New heuristic for harmonic means clustering
نویسندگان
چکیده
منابع مشابه
Variable neighbourhood search based heuristic for K-harmonic means clustering
Although there has been a rapid development of technology and increase of computation speeds, most of the real-world optimization problems still cannot be solved in a reasonable time. Some times it is impossible for them to be optimally solved, as there are many instances of real problems which cannot be addressed by computers at their present speed. In such cases, the heuristic approach can be...
متن کاملFuzzy J-Means: a new heuristic for fuzzy clustering
A fuzzy clustering problem consists of assigning a set of patterns to a given number of clusters with respect to some criteria such that each of them may belong to more than one cluster with di0erent degrees of membership. In order to solve it, we 2rst propose a new local search heuristic, called Fuzzy J-Means, where the neighbourhood is de2ned by all possible centroid-to-pattern relocations. T...
متن کاملA New Soft Computing Method for K-Harmonic Means Clustering
The K-harmonic means clustering algorithm (KHM) is a new clustering method used to group data such that the sum of the harmonic averages of the distances between each entity and all cluster centroids is minimized. Because it is less sensitive to initialization than K-means (KM), many researchers have recently been attracted to studying KHM. In this study, the proposed iSSO-KHM is based on an im...
متن کاملAnt clustering algorithm with K-harmonic means clustering
Clustering is an unsupervised learning procedure and there is no a prior knowledge of data distribution. It organizes a set of objects/data into similar groups called clusters, and the objects within one cluster are highly similar and dissimilar with the objects in other clusters. The classic K-means algorithm (KM) is the most popular clustering algorithm for its easy implementation and fast wo...
متن کاملJ-MEANS: a new local search heuristic for minimum sum of squares clustering
A new local search heuristic, called J-Means, is proposed for solving the minimum sum-of-squares clustering problem. The neighborhood of the current solution is deened by all possible centroid-to-entity relocations followed by corresponding changes of assignments. Moves are made in such neighborhoods until a local optimum is reached. The new heuristic is compared with two other well-known local...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Global Optimization
سال: 2014
ISSN: 0925-5001,1573-2916
DOI: 10.1007/s10898-014-0175-1